Statistic Analysis for Probabilistic Processes1
نویسندگان
چکیده
We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence problems. The Membership problem for a trace w and a Markov Decision Process S decides if there exists a strategy on S which generates with high probability traces close to w. We prove that Membership of a trace is testable and Equivalence of MDPs is polynomial time approximable. For Probabilistic Automata, Membership is not testable, and approximate Equivalence is undecidable. We give a class of properties, based on results concerning the structure of the tail σ-field of a finite Markov chain, which characterizes equivalent Markov Decision Processes in this context.
منابع مشابه
A Statistical-Probabilistic Pattern for Determination of Tunnel Advance Step by Quantitative Risk Analysis
One of the main challenges faced in design and construction phases of tunneling projects is the determination of maximum allowable advance step to maximize excavation rate and reduce project delivery time. Considering the complexity of determining this factor and unexpected risks associated with inappropriate determination of that, it is necessary to employ a method which is capable of accounti...
متن کاملA Study of Ultrasonic Liver Images Classification with Artificial Neural Networks Based on Fractal Geometry and Multiresolution Analysis
In this study, we evaluate the accuracy of classifiers for classification of ultrasonic liver tissues. Two different statistic classifiers ami three various artificial neural networks are included: Bayes classifier k-nearest neighbor classifier. Back-propagation neural networks, probabilistic neural network and modified probabilistic neural network. These Jive different classifiers were investi...
متن کاملA Probabilistic Approach to the Descent Statistic
We present a probabilistic approach to studying the descent statistic based upon a two-variable probability density. This density is log concave and, in fact, satisfies a higher order concavity condition. From these properties we derive quadratic inequalities for the descent statistic. Using Fourier series, we give exact expressions for the Euler numbers and the alternating r-signed permutation...
متن کاملProbabilistic analysis of stability of chain pillars in Tabas coal mine in Iran using Monte Carlo simulation
Performing a probabilistic study rather than a determinist one is a relatively easy way to quantify the uncertainty in an engineering design. Due to the complexity and poor accuracy of the statistical moment methods, the Monte Carlo simulation (MCS) method is wildly used in an engineering design. In this work, an MCS-based reliability analysis was carried out for the stability of the chain pill...
متن کاملTowards an Algorithmic
While Kolmogorov complexity is the accepted absolute measure of information content of an individual nite object, a similarly absolute notion is needed for the relation between an individual data sample and an individual model summarizing the information in the data, for example, a nite set where the data sample typically came from. The statistical theory based on such relations between individ...
متن کامل